Solution to a Question on a Family of Imprimitive Symmetric Graphs
نویسندگان
چکیده
We answer a recent question posed by Li et al. [‘Imprimitive symmetric graphs with cyclic blocks’, European J. Combin. 31 (2010), 362–367] regarding a family of imprimitive symmetric graphs. 2000 Mathematics subject classification: primary 05C25; secondary 05E99.
منابع مشابه
A Geometrical Approach to Imprimitive Graphs
We establish a geometrical framework for the study of imprimitive, G-symmetric graphs F by exploiting the fact that any G-partition B of the vertex set VT gives rise both to a quotient graph fB and to a tactical configuration D(B) induced on each block B e B . We also examine those cases in which D(B) is degenerate, and characterize the possible graphs f in many cases where the quotient FB is e...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملImprimitive cometric association schemes: Constructions and analysis
Dualizing the “extended bipartite double” construction for distance-regular graphs, we construct a new family of cometric (or Q-polynomial) association schemes with four associate classes based on linked systems of symmetric designs. The analysis of these new schemes naturally leads to structural questions concerning imprimitive cometric association schemes, some of which we answer with others ...
متن کاملDecompositions of complete multipartite graphs
This paper answers a recent question of Dobson and Marušič by partitioning the edge set of a complete bipartite graph into two parts, both of which are edge sets of arctransitive graphs, one primitive and the other imprimitive. The first member of the infinite family is the one constructed by Dobson and Marušič.
متن کامل